Geometrical Interpretation of the Master Theorem for Divide-and-conquer Recurrences
نویسنده
چکیده
We provide geometrical interpretation of the Master Theorem to solve divide-and-conquer recurrences. We show how different cases of the recurrences correspond to different kinds of fractal images. Fractal dimension and Hausdorff measure are shown to be closely related to the solution of such recurrences.
منابع مشابه
An Improved Master Theorem for Divide-and-Conquer Recurrences
We present a new master theorem for the study of divide-and-conquer recursive deenitions, which improves the old one in several aspects. In particular, it provides more information, frees us from technicalities like oors and ceilings, and covers a wider set of toll functions and weight distributions, stochastic recurrences included.
متن کاملProving Divide & Conquer Complexities in Isabelle/HOL
The Akra–Bazzi method [1], a generalisation of the well-known Master Theorem, is a useful tool for analysing the complexity of Divide & Conquer algorithms. This work describes a formalisation of the Akra–Bazzi method (as generalised by Leighton [14]) in the interactive theorem prover Isabelle/HOL and the derivation of a generalised version of the Master Theorem from it. We also provide some aut...
متن کاملNotes on Better Master Theorems for Divide-and-Conquer Recurrences
Techniques for solving divide-and-conquer recurrences are routinely taught to thousands of Computer Science students each year. The dominant approach to solving such recurrences is known as the Master Method [2]. Recently, Akra and Bazzi [1] discovered a surprisingly elegant generalization of the Master Method that yields a very simple formula for solving most divideand-conquer recurrences. In ...
متن کاملSolving Divide and Conquer Recurrences By Master Theorem á la Charlie
This paper discusses analysis of recursive problems. It delves first on their classification, and then the various methods of solving them, depending on which class the recursive relation belongs to. An improvement on the Master Method is then described and used to demonstrate how this method is used to solve recursive relations on Divide & Conquer problems. The revised method is found easier t...
متن کاملExact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used in the algorithm. This work shows that periodicity phenomena, often of a fractal nature, are ubiquitous in the performances of these algorithms. Mellin transforms and Dirichlet series are used to attain precise asympto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0906.5062 شماره
صفحات -
تاریخ انتشار 2009